Hierarchical Context Tagging for Utterance Rewriting
نویسندگان
چکیده
Utterance rewriting aims to recover coreferences and omitted information from the latest turn of a multi-turn dialogue. Recently, methods that tag rather than linearly generate sequences have proven stronger in both in- out-of-domain settings. This is due tagger's smaller search space as it can only copy tokens dialogue context. However, these may suffer low coverage when phrases must be added source utterance cannot covered by single context span. occur languages like English introduce such prepositions into rewrite for grammaticality. We propose hierarchical tagger (HCT) mitigates this issue predicting slotted rules (e.g., "besides_") whose slots are later filled with spans. HCT (i) tags string token-level edit actions (ii) fills resulting rule spans tagging allows add out-of-context multiple at once; we further cluster truncate long tail distribution. Experiments on several benchmarks show outperform state-of-the-art systems ~2 BLEU points.
منابع مشابه
Data driven methods for utterance semantic tagging
The proliferation of mobile devices, along with advances in speech and natural language processing technologies, have given birth to a new wave of personal assistance applications that enable users to quickly and more naturally perform many tasks through voice on their smart devices. This paper focuses on a natural language understanding (NLU) solution for one such application. We adopted a dat...
متن کاملContext-sensitive Utterance Planning for CCG
The paper presents an approach to utterance planning, which can dynamically use context information about the environment in which a dialogue is situated. The approach is functional in nature, using systemic networks to specify its planning grammar. The planner takes a description of a communicative goal as input, and produces one or more logical forms that can express that goal in a contextual...
متن کاملUsing Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting
Computational systems based on reducing expressions usually have a predefined reduction strategy to break down the nondeterminism which is inherent to reduction relations. The innermost strategy corresponds to call by value or eager computation, that is, the computational mechanism of several programming languages like Maude, OBJ, etc. where the arguments of a function call are always evaluated...
متن کاملLazy Rewriting and Context-Sensitive Rewriting
Lazy rewriting (LR) is intended to improve the termination behavior of TRSs. This is attempted by restricting reductions for selected arguments of functions. Similarly, context-sensitive rewriting (CSR) forbids any reduction on those arguments. We show that, under certain conditions, LR and CSR coincide. On the basis of this result, we also describe a transformation which permits proving termin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2022
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v36i10.21331